A Tableau Calculus for Quantifier-Free Set Theoretic Formulae
نویسندگان
چکیده
Set theory is the common language of mathematics. Therefore, set theory plays an important rôle in many important applications of automated deduction. In this paper, we present an improved tableau calculus for the decidable fragment of set theory called multi-level syllogistic with singleton (MLSS). Furthermore, we describe an extension of our calculus for the bigger fragment consisting of MLSS enriched with free (uninterpreted) function symbols (MLSSF).
منابع مشابه
A Tableau Calculus with Automaton-Labelled Formulae for Regular Grammar Logics
We present a sound and complete tableau calculus for the class of regular grammar logics. Our tableau rules use a special feature called automaton-labelled formulae, which are similar to formulae of automaton propositional dynamic logic. Our calculus is cut-free and has the analytic superformula property so it gives a decision procedure. We show that the known EXPTIME upper bound for regular gr...
متن کاملA Conservation Result concerning Bounded Theories and the Collection Axiom
We present two proofs, one proof-theoretic and one model-theoretic, showing that adding the ß ^-collection axioms to any bounded first-order theory R of arithmetic yields an extension which is V ̂ -conservative over R. Preliminaries. A theory of arithmetic R contains the nonlogic symbols 0, S, +, ■, and < . R may contain further nonlogical symbols; in particular S2 is a theory of arithmetic [1]....
متن کاملA Quantifier-Free Completion of Logic Programs
We present a proof theoretic approach to the problem of negation in logic programming. We introduce a quantifier-free sequent calculus which is sound for Negation as Failure. Some extensions of the calculus have 3-valued or intuitionistic interpretations.
متن کاملA New Fast Tableau - Based Decision Procedurefor an Unquanti ed Fragment of Set Theory ?
In this paper we present a new fast tableau-based decision procedure for the ground set-theoretic fragment Multi-Level Syllogistic with Singleton (in short MLSS) which avoids the interleaving of model checking steps. The underlying tableau calculus is based upon the system KE.
متن کاملTableaux for Regular Grammar Logics of Agents Using Automaton-Modal Formulae
We present sound and complete tableau calculi for the class of regular grammar logics and a class eRG of extended regular grammar logics which contains useful epistemic logics for reasoning about beliefs of agents. Our tableau rules use a special feature called automaton-modal formulae which are similar to formulae of automaton propositional dynamic logic. Our calculi are cut-free and have the ...
متن کامل